An Alternative backup Route with a Loop Free Routing Table Short Distance in Ad hoc Wireless

In a mobile ad hoc wireless networks (MANET), nodes communicate with each other via packet radios. However, in a MANET network, the mobility of the nodes and power limitations lead to an increased loss of connectivity between the mobile nodes when changing the route between nodes, which requires the routing table to be frequently updated. Hence, routing protocol plays an important role in updating the routing table when the nodes move from one area to another. By pre-computing a backup routing table in advance, the source can pass traffic through it without needing to wait for the routing table to be updated from where the failure occurs. This paper proposes a new algorithm, ARTSD (Alternative Routing Table Short Distance), to improve the existing DSDV (Destination Sequenced Distance Vector) protocol by creating a mesh network with different numbers of nodes to provide multiple alternative routes. The ARTSD algorithm determines the adjacent nodes for each node on the primary path and then selects one of these adjacent nodes as the backup next hop according to the least numbers of hops to the destination. The results show that loss of data packets, throughput and end-to-end delay times between source and destination have been improved by avoiding loops on the network. The results show that the new protocol does not degrade network performance by sending extra messages to construct the new backup routing table. A simulation (using an NS2 simulator) was undertaken to demonstrate the difference between using a DSDV protocol with or without the proposed schema.